Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time
نویسندگان
چکیده
منابع مشابه
Minimizing total weighted completion
We study the special case of the m machine ow shop problem in which the processing time of each operation of job j is equal to p j ; this variant of the ow shop problem is known as the proportionate ow shop problem. We show that for any number of machines and for any regular performance criterion we can restrict our search for an optimal schedule to permutation schedules. Moreover, we show that...
متن کاملA Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time
Co-flows model a modern scheduling setting that is commonly found in a variety of applications in distributed and cloud computing. In co-flow scheduling, there are m input ports and m output ports. Each co-flow j ∈ J can be represented by a bipartite graph between the input and output ports, where each edge (i, o) with demand dji,o means that d j i,o units of packets must be delivered from port...
متن کاملOnline heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
1Laboratory of Algorithms and Technologies for Networks Analysis National Research University Higher School of Economics 136 Rodionova street, Niznhy Novgorod 603093, Russia 2Department of Industrial and Systems Engineering, University of Florida 303 Weil Hall, Gainesville, FL, 32611, USA 3Department of Operations Management & Operations Research, University of Groningen Nettelbosje 2, 9747 AE ...
متن کاملPublic transport fleet scheduling for minimizing total transfer waiting time
Public transportation has been one of the most important research fields in the two last decades. The purpose of this paper is to create a schedule for public transport fleets such as buses and metro trains with the goal of minimizing the total transfer waiting time. We extend previous research works in the field of transit schedule with considering headways of each route as decision variables....
متن کاملSingle Machine Scheduling with Rejection: Minimizing Total Weighted Completion Time and Rejection Cost
In this paper, the authors consider a single machine scheduling problem with rejection. In traditional research, it is assumed all jobs must be processed. However, in the real-world situation, certain jobs can be rejected. In this study, the jobs can be either accepted and scheduled or be rejected at the cost of a penalty. Two objective functions are considered simultaneously: (1) minimization ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2019
ISSN: 2227-7390
DOI: 10.3390/math7090819